Divide and Conquer Scheme for Efficient Load Balancing in P2P network

نویسندگان

  • Mohanjeet Singh
  • Anuj Kumar Gupta
چکیده

A consequential piece of the network traffic is produced by P2P applications. To provide quality of services, P2P needs contribution of varied intermediate peers. P2P network allocate the structural opportunity of reciprocally sharing and dispenser user-created contents inside diversity of user society environments. These networks are the collections of huge quantity of diverse nodes recognized as peers. These peers contain various exciting features like selfconfiguration, adaptation and organization. One problem of peers is that they are scattered. To make the searching and fetching fast these peers should be well organized. In this paper we have proposed multicasting technique which can reduce the communication distance between peers, resources will be better utilized, minimal wastage of resources will be there and contents will be fetched properly. Keywords-P2P, Self-adaption, structured, unstructured, load balance

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adaptive Load Balancing for Divide-and-Conquer Grid Applications

Divide-and-conquer has been demonstrated as a simple and efficient programming model for grid applications. In previous work, we have presented the divide-and-conquer based Satin system and its load balancing algorithm, clusteraware work stealing (CRS). In this paper, we provide a detailed analysis of CRS with respect to important properties of grid systems, namely scalability, heterogeneous co...

متن کامل

Free Vibration Analysis of Repetitive Structures using Decomposition, and Divide-Conquer Methods

This paper consists of three sections. In the first section an efficient method is used for decomposition of the canonical matrices associated with repetitive structures. to this end, cylindrical coordinate system, as well as a special numbering scheme were employed. In the second section, divide and conquer method have been used for eigensolution of these structures, where the matrices are in ...

متن کامل

Efficient Random Sampling - Parallel, Vectorized, Cache-Efficient, and Online

We consider the problem of sampling n numbers from the range {1, . . . , N} without replacement on modern architectures. The main result is a simple divide-and-conquer scheme that makes sequential algorithms more cache efficient and leads to a parallel algorithm running in expected time O(n/p+ log p) on p processors. The amount of communication between the processors is very small and independe...

متن کامل

Applying a diffusive load balancing in a clustered P2P system

Although a large number of users are using P2P systems, the ability of these systems to provide services with quality is questioned. A load balanced P2P system can provide services with smaller failure rate and better performance; hence, service quality of the system can be improved. Cluster systems have been adopted for services which are tolerant to faults. Although a cluster structure improv...

متن کامل

Simple dynamic load balancing mechanism for structured P2P network and its evaluation

Many proposals have been advanced for structured P2P networks, but it is difficult for existing structured P2P networks to achieve dynamic load balancing sufficiently. In this paper, we propose a new structured P2P network called Waon, which achieves dynamic load balancing among nodes. Waon uses a simple algorithm of load balancing and a routing table based on the number of hops between nodes t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015